منابع مشابه
A lower bound for the b-adic diaphony
La diafonia b-adica è una misura quantitativa della irregularità di distribuzione di un insieme di punti nel cubo unità s-dimensionale. In questi appunti mostriamo che la diafonia b-adica (per un numero primo b) di un insieme di N punti nel cubo unità di dimensione s è sempre almeno di ordine (logN)(s−1)/2/N . Questo limite inferiore è il migliore possibile. Abstract The b-adic diaphony is a qu...
متن کاملThe lower bound for the number of 1-factors in generalized Petersen graphs
In this paper, we investigate the number of 1-factors of a generalized Petersen graph $P(N,k)$ and get a lower bound for the number of 1-factors of $P(N,k)$ as $k$ is odd, which shows that the number of 1-factors of $P(N,k)$ is exponential in this case and confirms a conjecture due to Lovász and Plummer (Ann. New York Acad. Sci. 576(2006), no. 1, 389-398).
متن کاملLower Bound on Testing
We introduce a new method of proving lower bounds on the depth of algebraic d-degree decision (resp. computation) trees and apply it to prove a lower bound (log N) (resp. (log N= log log N)) for testing membership to an n-dimensional convex polyhedron having N faces of all dimensions, provided that N > (nd) (n) (resp. N > n (n)). This bound apparently does not follow from the methods developed ...
متن کاملOn Lower Bound for W(K2n)
The lower boundW (K2n) ≥ 3n−2 is proved for the greatest possible number of colors in an interval edge coloring of the complete graph K2n. Let G = (V (G), E(G)) be an undirected graph without loops and multiple edges [1], V (G) and E(G) be the sets of vertices and edges of G, respectively. The degree of a vertex x ∈ V (G) is denoted by dG(x), the maximum degree of a vertex of G-by ∆(G), and the...
متن کاملLower Bound for String Matching on PRAM
Breslauer and Galil have shown that the string matching problem requires (d n p e + log log d1+p=ne 2p) rounds in the parallel comparison tree model with p comparisons in each round. In this note we show that the same lower bound even holds for the p-processor abstract Priority-CRCW PRAMs with bounded but arbitrary large memory. In this model one assumes that the internal computational power of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Uniform distribution theory
سال: 2020
ISSN: 2309-5377
DOI: 10.2478/udt-2020-0010